Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
نویسندگان
چکیده
منابع مشابه
The Shortest Common Ordered Supersequence Problem
In this paper, we consider the problem of the shortest common ordered supersequence. In particular, we consider an explicit reduction from the problem to the satisfiability problem.
متن کاملThe Shortest Common Parameterized Supersequence Problem
In this paper, we consider the problem of the shortest common parameterized supersequence. In particular, we consider an explicit reduction from the problem to the satisfiability problem.
متن کاملSolving Shortest Common Supersequence Problem Using Artificial Bee Colony Algorithm
The idea behind this work is to solve the Shortest Common Supersequence by using Artificial Bee Colony (ABC) Algorithm. This algorithm is considered as one of the newest nature-inspired swarm-based optimization algorithms and has a promising performance [6]. Shortest Common Supersequence is a classical problem in the field of strings and it is classified as NP-Hard problem [12]. Many algorithms...
متن کاملTowards a DNA Solution to the Shortest Common Superstring Problem
This paper proposes a DNA algorithm for solving an NP-complete problem (The Shortest Common Super-string Problem) by manipulation of biomolecules, and presents partial results of the experiment that implements our algorithm. We also discuss practical constraints that have to be taken into account when implementing the algorithm, propose a coding system as a solution to these practical restricti...
متن کاملThe shortest common supersequence problem in a microarray production setting
MOTIVATION During microarray production, several thousands of oligonucleotides (short DNA sequences) are synthesized in parallel, one nucleotide at a time. We are interested in finding the shortest possible nucleotide deposition sequence to synthesize all oligos in order to reduce production time and increase oligo quality. Thus we study the shortest common super-sequence problem of several tho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2006
ISSN: 1471-2105
DOI: 10.1186/1471-2105-7-s4-s12